Exploration Strategies for Building Compact Maps in Unbounded Environments
نویسندگان
چکیده
Exploration strategies are an important ingredient for map building with mobile robots. The traditional greedy exploration strategy is not directly applicable in unbounded outdoor environments, because it decides on the robot’s actions solely based on the expected information gain and travel cost. As this value can be optimized by driving straight into unexplored space, this behavior often leads to degenerated maps. We propose two different techniques to regularize the value function of the exploration strategy, in order to explore compact areas in outdoor environments. We compare exploration speed and compactness of the maps with and without our extensions.
منابع مشابه
Pullback D-attractors for non-autonomous partly dissipative reaction-diffusion equations in unbounded domains
At present paper, we establish the existence of pullback $mathcal{D}$-attractor for the process associated with non-autonomous partly dissipative reaction-diffusion equation in $L^2(mathbb{R}^n)times L^2(mathbb{R}^n)$. In order to do this, by energy equation method we show that the process, which possesses a pullback $mathcal{D}$-absorbing set, is pullback $widehat{D}_0$-asymptotically compact.
متن کاملSome Performance Bounds of Strategies for Graph Exploration
Exploration of unknown environments is relevant for many robotics applications, like map building and coverage. Several works in the literature have proposed exploration strategies that drive a mobile robot to greedily choose where to go next in order to incrementally map an initially unknown environment. In this paper, we theoretically study the worst and average traveled distance required to ...
متن کاملEntropy Gradient-based Exploration with Cooperative Robots in 3-D Mapping Missions
Building cooperatively 3-D maps of unknown environments is one of the application fields of multi-robot systems. This article focuses on the exploration problem with multiple robots, starting upon a previously proposed successful distributed architecture. An entropy gradient-based algorithm is used to select exploration viewpoints in the frontier between explored and unexplored regions. The arc...
متن کاملExploring Unknown Environments with Mobile Robots using Coverage Maps
In this paper we introduce coverage maps as a new way of representing the environment of a mobile robot. Coverage maps store for each cell of a given grid a posterior about the amount the corresponding cell is covered by an obstacle. Using this representation a mobile robot can more accurately reason about its uncertainty in the map of the environment than with standard occupancy grids. We pres...
متن کاملFrontier - Based Exploration Using Multiple Robots Brian
Frontier-based exploration directs mobile robots to regions on the boundary between unexplored space and space that is known to be open. Previously, we have demonstrated that frontier-based exploration can be used to map indoor environments where walls and obstacles may be in arbitrary orientations. In this paper, we show how frontier-based exploration can be extended to multiple robots. In our...
متن کامل